The k-Metric Dimension of Double Fan Graph
نویسندگان
چکیده
Diberikan graf terhubung dan sederhana $G=(V(G), E(G))$ bilangan bulat positif $k$. Himpunan $S \subseteq V(G)$ disebut sebagai pembangkit $k$-metrik jika untuk setiap pasang titik berbeda $u,v \in V(G)$, terdapat paling sedikit $k$ $w_{1}, w_{2}, \ldots, w_{k} S$ sedemikian sehingga $d(u,w_{i}) \neq d(v,w_{i})$ $i \{1,2,\ldots, k\}$, dengan $d(u,v)$ adalah panjang \emph{path} terpendek dari $u$ ke $v$. Pembangkit kardinalitas terkecil basis $k$-metrik, dimensi $G$ yang dinotasikan $dim_{k}(G)$. Pada tesis ini, akan disajikan nilai pada \emph{double fan}.
منابع مشابه
Adjacency metric dimension of the 2-absorbing ideals graph
Let Γ=(V,E) be a graph and W_(a)={w_1,…,w_k } be a subset of the vertices of Γ and v be a vertex of it. The k-vector r_2 (v∣ W_a)=(a_Γ (v,w_1),… ,a_Γ (v,w_k)) is the adjacency representation of v with respect to W in which a_Γ (v,w_i )=min{2,d_Γ (v,w_i )} and d_Γ (v,w_i ) is the distance between v and w_i in Γ. W_a is called as an adjacency resolving set for Γ if distinct vertices of ...
متن کاملModels for the k-metric dimension
For an undirected graph G = (V,E), a vertex τ ∈ V separates vertices u and v (where u, v ∈ V , u 6= v) if their distances to τ are not equal. Given an integer parameter k ≥ 1, a set of vertices L ⊆ V is a feasible solution if for every pair of distinct vertices, u, v, there are at least k distinct vertices τ1, τ2, . . . , τk ∈ L each separating u and v. Such a feasible solution is called a land...
متن کاملThe metric dimension and girth of graphs
A set $Wsubseteq V(G)$ is called a resolving set for $G$, if for each two distinct vertices $u,vin V(G)$ there exists $win W$ such that $d(u,w)neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. The minimum cardinality of a resolving set for $G$ is called the metric dimension of $G$, and denoted by $dim(G)$. In this paper, it is proved that in a connected graph $...
متن کاملOn the metric dimension of Cartesian powers of a graph
A set of vertices S resolves a graph if every vertex is uniquely determined by its vector of distances to the vertices in S. The metric dimension of a graph is the minimum cardinality of a resolving set of the graph. Fix a connected graph G on q ≥ 2 vertices, and let M be the distance matrix of G. We prove that if there exists w ∈ Z such that ∑ i wi = 0 and the vector Mw, after sorting its coor...
متن کاملThe Local Metric Dimension of Cyclic Split Graph
Let , be a graph with vertex set and edge set . Let then is said to be a local metric basis of , if for any two adjacent vertices , ⁄ , there exists a such that , , . The minimum cardinality of local metric basis is called the local metric dimension (lmd) of graph G. In this paper we investigate the local metric basis and local metric dimension of Cyclic Split Graph .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quadratic Journal of Innovation and Technology in Mathematics and Mathematics Education
سال: 2022
ISSN: ['2776-9003', '2776-8201']
DOI: https://doi.org/10.14421/quadratic.2022.021-05